OMReasoner: using multi-matchers and reasoner for ontology matching: results for OAEI 2012

Ontology matching produces correspondences between entities of two ontologies. The OMReasoner is unique in that it creates an extensible framework for combination of multiple individual matchers, and reasons about ontology matching by using description logic reasoner. It handles ontology matching in semantic level and makes full use of the semantic part of OWL-DL instead of structure. This paper describes the result of OMReasoner in the OAEI 2012 competition in two tracks: benchmark and conference. 1 Presentation of the system Ontology matching finds correspondences between semantically related entities of the ontologies. It plays a key role in many application domains. Many approaches to ontology matching have been proposed: the implementation of match may use multiple match algorithms or matchers, and the following largelyorthogonal classification criteria are considered [1-3]: schema-level and instance-level, element-level and structure-level, syntactic and semantic, language-based and constraint-based. Most approaches focus on syntactic aspects instead of semantic ones. OMReasoner achieves the matching by means of reasoning techniques. Still, this approach includes strategy of combination of (mainly syntactical) multi-matchers (e.g., EditDistance matcher, Prefix/Suffix matcher, WordNet matcher) before match reasoning. 1.1 State, purpose, general statement The matching process can be viewed as a function f. A’=f(O1, O2, A, p, r) Where O1 and O2 are a pair of ontologies as input to match, A is the input alignment between these ontologies and A’ is new alignment returned, p is a set of parameters (e.g., weight w and threshold τ) and r is a set of oracles and resources.